A polynomial Hutton theorem with applications
نویسندگان
چکیده
منابع مشابه
Hutton 1 Professor Jane Luise Hutton Publications
Publications Methodological articles [1] J L Hutton. Non-negative time series models for dry river flow. [2] J L Hutton and R G Owens. Bayesian sample size calculations and prior beliefs about child sexual abuse. [5] J L Hutton and P J Solomon. Parameter orthogonality in mixed regression models for survival data. Individual patient data meta-analysis of randomised anti-epileptic drug monotherap...
متن کاملA Covering Theorem with Applications
We prove a Covering Theorem that allows us to prove modified norm inequalities for general maximal operators. We will also give applications to convergence of a sequence of linear operators and the differentiation of the integral.
متن کاملRings with a setwise polynomial-like condition
Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.
متن کاملA scaled Bregman theorem with applications
Bregman divergences play a central role in the design and analysis of a range of machine learning algorithms through a handful of popular theorems. We present a new theorem which shows that “Bregman distortions” (employing a potentially non-convex generator) may be exactly re-written as a scaled Bregman divergence computed over transformed data. This property can be viewed from the standpoints ...
متن کاملA new separation theorem with geometric applications
Let G = (V (G), E(G)) be an undirected graph with a measure function μ assigning non-negative values to subgraphs H so that μ(H) does not exceed the clique cover number of H. When μ satisfies some additional natural conditions, we study the problem of separating G into two subgraphs, each with a measure of at most 2μ(G)/3 by removing a set of vertices that can be covered with a small number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2014
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2014.01.056